Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks with Wavelength Converters

نویسندگان

  • Li-Wei Chen
  • Eytan Modiano
چکیده

We consider the problem of wavelength assignment in a reconfigurable bi-directional ring network with wavelength converters. We show that for N -node P -port bidirectional rings, a minimum number of PN/4 wavelengths are required to support all possible virtual topologies in a rearrangeably non-blocking fashion, and provide an algorithm that meets this bound for connected topologies using no more than PN/2 wavelength converters. This improves over the tight lower bound of PN/3 wavelengths required for such rings given in [1] if no wavelength conversion is available. We also provide another algorithm that uses more wavelengths yet requires significantly fewer converters. Both algorithms are then extended to the case of unconnected topologies using at most one additional wavelength. Finally, we develop a method that allows the wavelength converters to be arbitrarily located at any node in the ring. This gives significant flexibility in the design of the networks. For example, all PN/2 converters can be collocated at a single hub node, or distributed evenly among the N nodes with P/2 converters at each node.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

A Scalable Wavelength Assignment Algorithm Using Minimal Number of Wavelength Converters in Resilient WDM Networks

Careful wavelength assignment (WA) to support lambda services is necessary to reduce the total number of wavelength converters (WCs), which are required every time the wavelength continuity constraint cannot be met in wavelength division multiplexing (WDM) networks. With the successful introduction of reconfigurable optical add-drop multiplexers (ROADMs) and related technologies, WDM networks a...

متن کامل

Efficient routing and wavelength assignment for reconfigurable WDM networks

Through the use of configurable wavelength-division-multiplexing (WDM) technology including tunable optical transceivers and frequency selective switches, next-generation WDM networks will allow multiple virtual topologies to be dynamically established on a given physical topology. For node port networks, we determine the number of wavelengths required to support all possible virtual topologies...

متن کامل

Efficient Lightpath Routing in Wavelength-Routed Optical Networks

We propose a new lightpath routing algorithm for WDM optical networks that solves the routing and wavelength assignment (commonly known as RWA) problem dynamically and separately. The RWA problem is partitioned into two subproblems, the routing and wavelength assignment problems, and both of them are solved using the shortest path routing technique. For solving the routing subproblem, an auxili...

متن کامل

An efficient heuristic for routing and wavelength assignment in optical WDM networks

We propose an efficient heuristic algorithm that sets up and releases lightpaths for connection requests dynamically. We partition the routing and wavelength assignment (commonly known as RWA) problem into two subproblems and solves both of them using a well-known shortest path routing algorithm. For solving the routing subproblem, an auxiliary graph is created whereby the nodes and links in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002